Quota and Gmin Merging Operators
نویسندگان
چکیده
In this paper, two families of merging operators are considered: quota operators and Gmin operators. Quota operators rely on a simple idea: any possible world is viewed as a model of the result of the merging when it satisfies “sufficiently many” bases from the given profile (a multi-set of bases). Different interpretations of the “sufficiently many” give rise to specific operators. Each Gmin operator is parameterized by a pseudo-distance and each of them is intended to refine the quota operators (i.e., to preserve more information). Quota and Gmin operators are evaluated and compared along four dimensions: rationality, computational complexity, strategy-proofness, and discriminating power. Those two families are shown as interesting alternatives to the formula-based merging operators (which selects some formulas in the union of the bases).
منابع مشابه
On the Logic of Merging: Quota and Gmin Operators
In this paper, two families of merging operators are considered: quota operators and Gmin operators. Quota operators rely on a simple idea: any possible world is viewed as a model of the result of the merging when it satisfies “sufficiently many” bases from the given profile (a multi-set of bases). Each interpretation of the “sufficiently many” gives rise to a specific operator. Each Gmin opera...
متن کاملDisjunctive merging: Quota and Gmin merging operators
When aggregating information from a group of agents, accepting the pieces of information shared by all agents is a natural requirement. In this paper, we investigate such a unanimity condition in the setting of propositional merging. We discuss two interpretations of the unanimity condition. We show that the first interpretation is captured by existing postulates for merging. But the second int...
متن کاملQuota-Based Merging Operators for Stratified Knowledge Bases
Current merging methods for stratified knowledge bases are often based on the commensurability assumption, i.e. all knowledge bases share a common scale. However, this assumption is too strong in practice. In this paper, we propose a family of operators to merge stratified knowledge bases without commensurability assumption. Our merging operators generalize the quota operators, a family of impo...
متن کاملSAT Encodings for Distance-Based Belief Merging Operators
We present SAT encoding schemes for distance-based belief merging operators relying on the (possibly weighted) drastic distance or the Hamming distance between interpretations, and using sum, GMax (leximax) or GMin (leximin) as aggregation function. In order to evaluate these encoding schemes, we generated benchmarks of a time-tabling problem and translated them into belief merging instances. T...
متن کاملManipulation of Weighted Voting Games and the Effect of Quota
The Shapley-Shubik, Banzhaf, and Deegan-Packel indices are three prominent power indices for measuring voters’ power in weighted voting games. We consider two methods of manipulating weighted voting games, called annexation and merging. These manipulations allow either an agent, called an annexer to take over the voting weights of some other agents, or the coming together of some agents to form...
متن کامل